A new dominance rule to minimize total weighted tardiness with unequal release dates
نویسندگان
چکیده
منابع مشابه
A new dominance rule to minimize total weighted tardiness with unequal release dates
We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a sucient condition for local optimality. Therefore, if any sequence violates the dominance rule then switching the violating jobs either lowers the total weighted tardiness or leav...
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملDominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
We address the parallel machine total weighted tardiness scheduling problem with release dates. We describe dominance rules and filtering methods for this problem. Most of them are adaptations of dominance rules based on solution methods for the single-machine problem. We show how it is possible to deduce whether or not certain jobs can be processed by a particular machine in a particular conte...
متن کاملA Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. We introduce new lower bounds and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. Computational results show that the proposed approach outperforms the best known proc...
متن کاملA Branch and Bound Procedure to Minimize Total Tardiness or Total Completion time on One Machine with Different Release Dates
In this paper, we present a Branch and Bound procedure to minimize total tardiness on one machine with different release dates. We introduce a new lower bound and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. We also show how we can generalize different techniques to minimize total completion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2001
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(00)00319-2